package test2;

public class demo88 {
 /*   public class Solution {
        public ListNode reverse(ListNode phead)
        {
            ListNode cur = phead;
            ListNode tmp = null;
            while(cur!=null)
            {
                ListNode next = cur.next;
                cur.next = tmp;
                tmp.next = cur;
                cur = next;
            }
            return tmp.next;
        }
        public ListNode FindKthToTail (ListNode pHead, int k) {
            if(pHead==null) return null;
            ListNode head1 = reverse(pHead);
            while(k>0)
            {
                head1 = head1.next;
                k--;
            }
            return head1;
        }
    }*/
}
